Quadrature formulas for Fourier coefficients

Quadrature formulas for Fourier coefficients

Quadrature formulae for Fourier coefficients

We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the Fourier-Tchebycheff coefficients given by Michhelli and Sharma and construct new Gaussian formulas for the Fourier coefficients of a func...

Kronrod extensions with multiple nodes of quadrature formulas for Fourier coefficients

We continue with analyzing quadrature formulas of high degree of precision for computing the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials, started recently by Bojanov and Petrova [Quadrature formulae for Fourier coefficients, J. Comput. Appl. Math. 231 (2009), 378–391] and we extend their results. Construction of new Gaussian quadrature form...

OPTIMAL QUADRATURE FORMULAS FOR FOURIER COEFFICIENTS IN W ( m , m − 1 ) 2 SPACE

This paper studies the problem of construction of optimal quadrature formulas in the sense of Sard in the W (m,m−1) 2 [0, 1] space for calculating Fourier coefficients. Using S. L. Sobolev’s method we obtain new optimal quadrature formulas of such type for N + 1 ≥ m, where N + 1 is the number of the nodes. Moreover, explicit formulas for the optimal coefficients are obtained. We investigate the...

Anti-Gaussian quadrature formulas

An anti-Gaussian quadrature formula is an (n+ 1)-point formula of degree 2n− 1 which integrates polynomials of degree up to 2n+ 1 with an error equal in magnitude but of opposite sign to that of the n-point Gaussian formula. Its intended application is to estimate the error incurred in Gaussian integration by halving the difference between the results obtained from the two formulas. We show tha...